Graph problems arising from parameter identification of discrete dynamical systems
نویسندگان
چکیده
منابع مشابه
On Two-parameter Dynamical Systems and Applications
In this note some useful properties of strongly continuous two-parameter semigroups of operators are studied, an exponential formula for two-parameter semigroups of operators on Banach spaces is obtained and some applied examples of two-parameter dynamical systems are discussed
متن کاملMultiscale analysis for nonlinear variational problems arising from discrete systems
The object of this thesis is the study of high density discrete systems as variational limit of low density discrete energies indexed by the number of nodes of the system itself. In this context the term discreteness should be understood rather broadly as inferring to different scales from crystal lattice to grain structure while the low-to-high density limit refers to the discrete-to-continuum...
متن کاملENTROPY OF DYNAMICAL SYSTEMS ON WEIGHTS OF A GRAPH
Let $G$ be a finite simple graph whose vertices and edges are weighted by two functions. In this paper we shall define and calculate entropy of a dynamical system on weights of the graph $G$, by using the weights of vertices and edges of $G$. We examine the conditions under which entropy of the dynamical system is zero, possitive or $+infty$. At the end it is shown that, for $rin [0,+infty]$, t...
متن کاملPROJECTED DYNAMICAL SYSTEMS AND OPTIMIZATION PROBLEMS
We establish a relationship between general constrained pseudoconvex optimization problems and globally projected dynamical systems. A corresponding novel neural network model, which is globally convergent and stable in the sense of Lyapunov, is proposed. Both theoretical and numerical approaches are considered. Numerical simulations for three constrained nonlinear optimization problems a...
متن کاملCongruence Identities Arising From Dynamical Systems
By counting the numbers of periodic points of all periods for some interval maps, we obtain infinitely many new congruence identities in number theory. Let S be a nonempty set and let f be a map from S into itself. For every positive integer n, we define the n iterate of f by letting f 1 = f and f = f ◦ f for n ≥ 2. For y ∈ S, we call the set { f(y) : k ≥ 0 } the orbit of y under f . If f(y) = ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Mathematical Methods of Operations Research
سال: 2011
ISSN: 1432-2994,1432-5217
DOI: 10.1007/s00186-011-0356-3